The Dual Complexity Space as the Dual of a Normed Cone

نویسندگان

  • Salvador Romaguera
  • Enrique Alfonso Sánchez-Pérez
  • Óscar Valero
چکیده

In [15] M. Schellekens introduced the complexity (quasi-metric) space as a part of the research in Theoretical Computer Science and Topology, with applications to the complexity analysis of algorithms. Later on, S. Romaguera and M. Schellekens ([13]) introduced the so-called dual complexity (quasi-metric) space and established several quasi-metric properties of the complexity space via the analysis of th e dual. These authors also proved in [14] that actually the dual complexity space C can be modeled as a norm-weightable cone whose induced quasi-metric is Smyth complete. This fact suggests the existence of deep connections between a general theory of (dual) complexity spaces and Asymmetric Functional Analysis. These connections have been recently explored in [3], [4] and [8]. In particular, it was proved in [3] that the so-called dual p-complexity space C∗ p , with 1 ≤ p < ∞, is isometrically isomorphic to the positive cone of the classical Banach space lp. The space C 1 is exactly the dual complexity space, and thus it is isometrically isomorphic to the positive cone of the Banach space l1 of all absolutely summable real sequences. Here, we continue the analysis of the structure of the dual complexity space C. We show that it is the dual space of the positive c one of the Banach space c0 of all real sequences converging to zero, and that its dual space is the positive cone of the Banach space l∞ of all bounded real sequences. Furthermore, the dual space of C p , 1 < p < ∞, is C∗ q where 1/p+ 1/q = 1. These results extend to this setting well-known theorems of the classical theory of Functional Analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quotient normed cones

Given a normed cone (X , p) and a subcone Y, we construct and study the quotient normed cone (X/Y, p̃) generated by Y . In particular we characterize the bicompleteness of (X/Y, p̃) in terms of the bicompleteness of (X , p), and prove that the dual quotient cone ((X/Y )∗,‖ · ‖p̃,u) can be identified as a distinguished subcone of the dual cone (X∗,‖ · ‖p,u). Furthermore, some parts of the theory ar...

متن کامل

STABILITY OF THE JENSEN'S FUNCTIONAL EQUATION IN MULTI-FUZZY NORMED SPACES

In this paper, we define the notion of (dual) multi-fuzzy normedspaces and describe some properties of them. We then investigate Ulam-Hyers stability of Jensen's functional equation for mappings from linear spaces into  multi-fuzzy normed spaces. We establish an asymptotic behavior of the Jensen equation in the framework of multi-fuzzy normed spaces.

متن کامل

The second dual of strongly zero-product preserving maps

The notion of strongly Lie zero-product preserving maps on normed algebras as a generalization of Lie zero-product preserving maps are dened. We give a necessary and sufficient condition from which a linear map between normed algebras to be strongly Lie zero-product preserving. Also some hereditary properties of strongly Lie zero-product preserving maps are presented. Finally the second dual of...

متن کامل

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

متن کامل

The supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances

Recently, E.A. Emerson and C.S. Jutla (SIAM J. Comput., 1999), have successfully applied complexity of tree automata to obtain optimal deterministic exponential time algorithms for some important modal logics of programs. The running time of these algorithms corresponds, of course, to complexity functions which are potential functions and, thus, they do not belong, in general, to any dual p-com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 161  شماره 

صفحات  -

تاریخ انتشار 2006